Characterization of Zm-well-covered graphs for some classes of graphs
نویسندگان
چکیده
A graph G is a Zm-well-covered graph if |I1| ≡ |I2| (modm) for all maximal independent sets I1 and I2 in V (G) [3]. The recognition problem of Zm-well-covered graphs is a Co-NP-Complete problem. We give a characterization of Zm-well-covered graphs for chordal, simplicial and circular arc graphs. c © 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
A characterisation of cubic parity graphs
A graph is Zm-well-covered if all maximal independent sets have the same cardinality modulo m. Zm-well-covered graphs generalise well-covered graphs, those in which all independent sets have the same cardinality. Z2-well-covered graphs are also called parity graphs. A characterisation of cubic well-covered graphs was given by Campbell, Ellingham and Royle. Here we extend this to a characterisat...
متن کاملA generalization of Villarreal's result for unmixed tripartite graphs
In this paper we give a characterization of unmixed tripartite graphs under certain conditions which is a generalization of a result of Villarreal on bipartite graphs. For bipartite graphs two different characterizations were given by Ravindra and Villarreal. We show that these two characterizations imply each other.
متن کاملThe Center and Periphery of Composite Graphs
The center (periphery) of a graph is the set of vertices with minimum (maximum) eccentricity. In this paper, the structure of centers and peripheries of some classes of composite graphs are determined. The relations between eccentricity, radius and diameter of such composite graphs are also investigated. As an application we determine the center and periphery of some chemical graphs such as nan...
متن کاملUnmixed $r$-partite graphs
Unmixed bipartite graphs have been characterized by Ravindra and Villarreal independently. Our aim in this paper is to characterize unmixed $r$-partite graphs under a certain condition, which is a generalization of Villarreal's theorem on bipartite graphs. Also, we give some examples and counterexamples in relevance to this subject.
متن کاملConstructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 233 شماره
صفحات -
تاریخ انتشار 2001